Modeling Complex Points up to Isotopy
نویسندگان
چکیده
منابع مشابه
Small Non-Associative Division Algebras up to Isotopy
Assume a distributed database consisting of a large number of objects that can be created, deleted, and modified by manipulations. We want to capture the state of the system in a very small bit-string (a signature as in [2]). We now hash (map) the set of all possible manipulations into a finite, non-associative algebra. We can capture the state of an object also in a signature, an element in th...
متن کاملFrom symplectic deformation to isotopy
Let X be an oriented 4-manifold which does not have simple SW-type, for example a blow-up of a rational or ruled surface. We show that any two cohomologous and deformation equivalent symplectic forms on X are isotopic. This implies that blow-ups of these manifolds are unique, thus extending work of Biran. We also establish uniqueness of structure for certain fibered 4-manifolds.
متن کاملA-Discriminants for Complex Exponents and Counting Real Isotopy Types
We take a first step toward extending the theory of A-discriminants, and Kapranov’s parametrization of A-discriminant varieties [Kap91], to a broader family of functions including polynomials as a very special case. As an application, we prove a quadratic upper bound on the number of isotopy types of real zero sets of certain n-variate exponential sums, in a setting where the best previous boun...
متن کاملPosets on up to 16 Points
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer program based on this algorithm, in particular the numbers of nonisomorphic posets on 15 and 16 points and the numbers of labelled posets and topologies on 17 and 18 points.
متن کاملEfficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin’s braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially suitable for cryptographical applications. Most results appear in literature; however, some results about the greedy normal form and the symmetric normal form an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometric Analysis
سال: 2012
ISSN: 1050-6926,1559-002X
DOI: 10.1007/s12220-012-9312-6